STRATEGIES FOR LOOP PREVENTION FORWARDING LOGIC IN HYBRID INFORMATION CENTRIC NETWORKING

Techniques are described herein that provide a forwarding strategy applicable to Information Centric Networking (ICN) networks and hybrid ICN (hICN) networks. In such networks, Interest requests are likely to be hair-pinned back to a Forwarder that is serving a dynamic cache system. When the dynamic cache system has no representation of the named data object, the Forwarder must recycle the Interest request back into the network. However, the Forwarding logic must avoid hair-pinning the Interest back to the same unpopulated cache

FAST EDGE ACCESS CONTROL FOR ROUTED TRAFFIC

Real-Time Communication (RTC) traffic typically leverages one or more media bridges (often located in the cloud) and, in order to reduce latency and/or offload cloud resources to the edge, one or more real-time edge relays can be utilized in order to optimize such traffic. Presented herein are techniques to secure a media edge relay node without requiring an authentication for a connection involving the media edge relay node

TECHNIQUES TO PROVIDE EDGE RELAYS WITH PRIVACY-PRESERVING CACHES

Real-Time Communication (RTC) traffic typically leverages one or more media bridges (often located in the cloud) and, in order to reduce latency and/or offload cloud resources to the edge, one or more real-time edge relays can be utilized in order to optimize such traffic. However, edge relays may also be exploited by malicious entities and, thus, certain protective mechanisms are typically utilized at edge relays that, while reducing the probability of being exploited, can reduce the throughput of such edge relays. Techniques presented herein may help to preserve data privacy at edge relays through the use of a time-local caching mechanism

A comparative study of RTC applications

Real-Time Communication (RTC) applications have become ubiquitous and are nowadays fundamental for people to communicate with friends and relatives, as well as for enterprises to allow remote working and save travel costs. Countless competing platforms differ in the ease of use, features they implement, supported user equipment and targeted audience (consumer of business). However, there is no standard protocol or interoperability mechanism. This picture complicates the traffic management, making it hard to isolate RTC traffic for prioritization or obstruction. Moreover, undocumented operation could result in the traffic being blocked at firewalls or middleboxes. In this paper, we analyze 13 popular RTC applications, from widespread consumer apps, like Skype and Whatsapp, to business platforms dedicated to enterprises - Microsoft Teams and Webex Teams. We collect packet traces under different conditions and illustrate similarities and differences in their use of the network. We find that most applications employ the well-known RTP protocol, but we observe a few cases of different (and even undocumented) approaches. The majority of applications allow peer-to-peer communication during calls with only two participants. Six of them send redundant data for Forward Error Correction or encode the user video at different bitrates. In addition, we notice that many of them are easy to identify by looking at the destination servers or the domain names resolved via DNS. The packet traces we collected, along with the metadata we extract, are made available to the community

Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks

Content-centric networking (CCN) advocates a new trans-port model tailored to named-data communication. Three features distinguish CCN transport from the TCP/IP model: unique endpoint at the receiver, pull-based data retrieval in a point to multi-point fashion and in-path caching. The definition of transport control mechanisms is of fun-damental importance within the CCN architectural design and beyond, in the broader scope of information-centric net-works. In this work, we propose a joint Hop-by-hop and Receiver-driven Interest Control Protocol (HR-ICP) to reg-ulate user requests (Interests) either at the receiver and at intermediate nodes via Interest shaping. We prove that HR-ICP is stable and converges to an efficient and max-min fair equilibrium. Compared to controlling traffic only at the re-ceiver, HR-ICP accelerates congestion reaction and reduces the loss rate, as we show by means of CCN packet-level sim-ulations. In different network scenarios, we highlight the advantages of our solution in terms of faster convergence to the optimal throughput, robustness against misbehaving re-ceivers and flow protection of delay-sensitive applications